|
In mathematics, solid partitions are natural generalizations of partitions and plane partitions defined by Percy Alexander MacMahon.〔P. A. MacMahon, Combinatory Analysis. Cambridge Univ. Press, London and New York, Vol. 1, 1915 and Vol. 2, 1916; see vol. 2, p 332.〕 A solid partition of is a three-dimensional array, , of non-negative integers (the indices ) such that : and : Let denote the number of solid partitions of . As the definition of solid partitions involves three-dimensional arrays of numbers, they are also called three-dimensional partitions in notation where plane partitions are two-dimensional partitions and partitions are one-dimensional partitions. Solid partitions and their higher-dimensional generalizations are discussed in the book by Andrews.〔G. E. Andrews, ''The theory of partitions'', Cambridge University Press, 1998.〕 == Ferrers diagrams for solid partitions == Another representation for solid partitions is in the form of Ferrers diagrams. The Ferrers diagram of a solid partition of is a collection of points or ''nodes'', , with satisfying the condition:〔A. O. L. Atkin, P. Bratley, I. G. McDonald and J. K. S. McKay, Some computations for'' ''m-dimensional partitions, Proc. Camb. Phil. Soc., 63 (1967), 1097–1100.〕 :Condition FD: If the node , then so do all the nodes with for all . For instance, the Ferrers diagram : where each column is a node, represents a solid partition of . There is a natural action of the permutation group on a Ferrers diagram – this corresponds to permuting the four coordinates of all nodes. This generalises the operation denoted by conjugation on usual partitions. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Solid partition」の詳細全文を読む スポンサード リンク
|